Heuristics Miner for Time Intervals
نویسندگان
چکیده
Process Mining attempts to reconstruct the workflow of a business process from logs of activities. This task is quite important in business scenarios where there is not a well understood and structured definition of the business process performed by workers. Activities logs are thus mined in the attempt to reconstruct the actual business process. In this paper, we propose the generalization of a popular process mining algorithm, named Heuristics Miner, to time intervals. We show that the possibility to use, when available, time interval information for the performed activities allows the algorithm to produce better workflow models.
منابع مشابه
Improving the quality of the Heuristics Miner in ProM 6.2
Considering the presence of large amounts of data in organizations today, the need to transform this data into useful information and subsequently into knowledge, increasingly gains attention. Process discovery is a technique to automatically discover process models from data in event logs. Since process discovery is gaining attention among researchers as well as practitioners, the quality of t...
متن کاملcAnt-Miner: An Ant Colony Classification Algorithm to Cope with Continuous Attributes
This paper presents an extension to Ant-Miner, named cAntMiner (Ant-Miner coping with continuous attributes), which incorporates an entropy-based discretization method in order to cope with continuous attributes during the rule construction process. By having the ability to create discrete intervals for continuous attributes “on-the-fly”, cAnt-Miner does not requires a discretization method in ...
متن کاملA Novel Acceleration Technique to Improve the Speed of Mining Frequent U2 Patterns
Frequent pattern mining is the method of finding patterns like itemsets, subsequences and substructures that repeatedly occur in a dataset. In Univariate Uncertain data, each attribute present in a transaction is represented by a quantitative interval and a probability value. U2P-Miner algorithm is used to mine frequent patterns from U2 data. The number of intervals has a great impact on the ti...
متن کاملA bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics
This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...
متن کاملEffective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010